17 research outputs found

    Analysis of complex contagions in random multiplex networks

    Full text link
    We study the diffusion of influence in random multiplex networks where links can be of rr different types, and for a given content (e.g., rumor, product, political view), each link type is associated with a content dependent parameter cic_i in [0,∞][0,\infty] that measures the relative bias type-ii links have in spreading this content. In this setting, we propose a linear threshold model of contagion where nodes switch state if their "perceived" proportion of active neighbors exceeds a threshold \tau. Namely, a node connected to mim_i active neighbors and ki−mik_i-m_i inactive neighbors via type-ii links will turn active if ∑cimi/∑ciki\sum{c_i m_i}/\sum{c_i k_i} exceeds its threshold \tau. Under this model, we obtain the condition, probability and expected size of global spreading events. Our results extend the existing work on complex contagions in several directions by i) providing solutions for coupled random networks whose vertices are neither identical nor disjoint, (ii) highlighting the effect of content on the dynamics of complex contagions, and (iii) showing that content-dependent propagation over a multiplex network leads to a subtle relation between the giant vulnerable component of the graph and the global cascade condition that is not seen in the existing models in the literature.Comment: Revised 06/08/12. 11 Pages, 3 figure

    Message-Passing Methods for Complex Contagions

    Full text link
    Message-passing methods provide a powerful approach for calculating the expected size of cascades either on random networks (e.g., drawn from a configuration-model ensemble or its generalizations) asymptotically as the number NN of nodes becomes infinite or on specific finite-size networks. We review the message-passing approach and show how to derive it for configuration-model networks using the methods of (Dhar et al., 1997) and (Gleeson, 2008). Using this approach, we explain for such networks how to determine an analytical expression for a "cascade condition", which determines whether a global cascade will occur. We extend this approach to the message-passing methods for specific finite-size networks (Shrestha and Moore, 2014; Lokhov et al., 2015), and we derive a generalized cascade condition. Throughout this chapter, we illustrate these ideas using the Watts threshold model.Comment: 14 pages, 3 figure

    Ammonium O,O-dicyclohexyl phosphorodithioate

    No full text
    SOYLU, SERKAN M/0000-0002-8440-1260WOS: 000236647600024PubMed: 16518052The structure of the title compound, NH4+center dot C12H22O2PS2-, consists of a polymeric arrangement of ammonium cations and O,O-dicyclohexyl phosphorodithioate anions linked through N-H center dot center dot center dot O and N-H center dot center dot center dot S hydrogen bonds. These interactions result in the formation of (100) sheets

    Multi-objective Optimization for Multi-level Networks

    No full text
    corecore